| 翻訳と辞書 |
| Bisection method ： ウィキペディア英語版 |
Bisection method
The bisection method in mathematics is a root-finding method that repeatedly bisects an interval and then selects a subinterval in which a root must lie for further processing. It is a very simple and robust method, but it is also relatively slow. Because of this, it is often used to obtain a rough approximation to a solution which is then used as a starting point for more rapidly converging methods. The method is also called the interval halving method,〔http://siber.cankaya.edu.tr/NumericalComputations/ceng375/node32.html〕 the binary search method, or the dichotomy method.〔(Encyclopedia of Mathematics )〕
== The method ==
The method is applicable for numerically solving the equation ''f''(''x'') = 0 for the real variable ''x'', where ''f'' is a continuous function defined on an interval () and where ''f''(''a'') and ''f''(''b'') have opposite signs. In this case ''a'' and ''b'' are said to bracket a root since, by the intermediate value theorem, the continuous function ''f'' must have at least one root in the interval (''a'', ''b'').
At each step the method divides the interval in two by computing the midpoint ''c'' = (''a''+''b'') / 2 of the interval and the value of the function ''f''(''c'') at that point. Unless ''c'' is itself a root (which is very unlikely, but possible) there are now only two possibilities: either ''f''(''a'') and ''f''(''c'') have opposite signs and bracket a root, or ''f''(''c'') and ''f''(''b'') have opposite signs and bracket a root.〔If the function has the same sign at the endpoints of an interval, the endpoints may or may not bracket roots of the function.〕 The method selects the subinterval that is guaranteed to be a bracket as the new interval to be used in the next step. In this way an interval that contains a zero of ''f'' is reduced in width by 50% at each step. The process is continued until the interval is sufficiently small.
Explicitly, if ''f''(''a'') and ''f''(''c'') have opposite signs, then the method sets ''c'' as the new value for ''b'', and if ''f''(''b'') and ''f''(''c'') have opposite signs then the method sets ''c'' as the new ''a''. (If ''f''(''c'')=0 then ''c'' may be taken as the solution and the process stops.) In both cases, the new ''f''(''a'') and ''f''(''b'') have opposite signs, so the method is applicable to this smaller interval.〔 for section〕
抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』
■ウィキペディアで「Bisection method」の詳細全文を読む
スポンサード リンク
| 翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|